The Whitney Trick

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems

Motivated by topological Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R without triple, quadruple, or, more generally, r-fold points (image points with at least r distinct preimages), for a given multiplicity r ≥ 2. In particular, we are i...

متن کامل

Translated Whitney and r-Whitney Numbers: A Combinatorial Approach

Using a combinatorial approach, we introduce the translated Whitney numbers. This seems to be more natural than to write a product of anarithmetical progression in terms of a power variable and conversely. We also extend our ideas to translated r-Whitney numbers of both kinds and to translated Whitney-Lah numbers.

متن کامل

The Kernel Trick for Distances

A method is described which, like the kernel trick in support vector machines (SVMs), lets us generalize distance-based algorithms to operate in feature spaces, usually nonlinearly related to the input space. This is done by identifying a class of kernels which can be represented as norm-based distances in Hilbert spaces. It turns out that common kernel algorithms, such as SVMs and kernel PCA, ...

متن کامل

The Birthday Trick with Lies

In this article, we determine the number of yes/no questions required to figure out a birthday (a number between 0 and 31) when up to r incorrect answers to these questions are allowed. In the language of error-correcting codes, we construct optimal (shortest possible length) codes of size 32 and minimal distance d for each positive integer d .

متن کامل

Whitney Elements on Pyramids

V. GRADINARU AND R. HIPTMAIR † Abstract. Conforming finite elements inH(div; Ω) andH(curl; Ω) can be regarded as discrete differential forms (Whitney–forms). The construction of such forms is based on an interpolation idea, which boils down to a simple extension of the differential form to the interior of elements. This flexible approach can accommodate elements of more complicated shapes than ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 1996

ISSN: 0166-8641

DOI: 10.1016/0166-8641(95)00045-3